Heat Kernels, Manifolds and Graph Embedding
نویسندگان
چکیده
In this paper, we investigate the use of heat kernels as a means of embedding graphs in a pattern space. We commence by performing the spectral decomposition on the graph Laplacian. The heat kernel of the graph is found by exponentiating the resulting eigensystem over time. By equating the spectral heat kernel and its Gaussian form we are able to approximate the geodesic distance between nodes on a manifold. We use the resulting pattern of distances to embed the trees in a Euclidean space using multidimensional scaling. The arrangement of points in this space can be used to construct pattern vectors suitable for clustering the graphs. Here we compute a weighted proximity matrix, and from the proximity matrix a Laplacian matrix is computed. We use the eigenvalues of the Laplacian matrix to characterise the distribution of points representing the embedded nodes. Experiments on sets of shock graphs reveal the utility of the method on real-world data.
منابع مشابه
Heat kernels on manifolds, graphs and fractals
We consider heat kernels on different spaces such as Riemannian manifolds, graphs, and abstract metric measure spaces including fractals. The talk is an overview of the relationships between the heat kernel upper and lower bounds and the geometric properties of the underlying space. As an application some estimate of higher eigenvalues of the Dirichlet problem is considered.
متن کاملUniversal Local Parametrizations via Heat Kernels and Eigenfunctions of the Laplacian
We use heat kernels or eigenfunctions of the Laplacian to construct local coordinates on large classes of Euclidean domains and Riemannian manifolds (not necessarily smooth, e.g. with Cα metric). These coordinates are bi-Lipschitz on embedded balls of the domain or manifold, with distortion constants that depend only on natural geometric properties of the domain or manifold. The proof of these ...
متن کاملEigenvalue inequalities for graphs and convex subgraphs
For an induced subgraph S of a graph, we show that its Neumann eigenvalue λS can be lower-bounded by using the heat kernel Ht(x, y) of the subgraph. Namely, λS ≥ 1 2t ∑ x∈S inf y∈S Ht(x, y) √ dx √ dy where dx denotes the degree of the vertex x. In particular, we derive lower bounds of eigenvalues for convex subgraphs which consist of lattice points in an d-dimensional Riemannian manifolds M wit...
متن کاملPrecise Gaussian estimates of heat kernels on asymptotically flat Riemannian manifolds with poles
We give precise Gaussian upper and lower bound estimates on heat kernels on Riemannian manifolds with poles under assumptions that the Riemannian curvature tensor goes to 0 sufficiently fast at infinity. Under additional assumptions on the curvature, we give estimates on the logarithmic derivatives of the heat kernels. The proof relies on the Elworthy-Truman’s formula of heat kernels and Elwort...
متن کاملDifferential Harnack Inequalities on Riemannian Manifolds I : Linear Heat Equation
Abstract. In the first part of this paper, we get new Li-Yau type gradient estimates for positive solutions of heat equation on Riemmannian manifolds with Ricci(M) ≥ −k, k ∈ R. As applications, several parabolic Harnack inequalities are obtained and they lead to new estimates on heat kernels of manifolds with Ricci curvature bounded from below. In the second part, we establish a Perelman type L...
متن کامل